

//1.最大公约数的路
#include<iostream>

#include<vector>

#include<unordered_map>

using namespace std;

int MaxGCD(int n){
  int max = 0;
  for(int i = 1;i<n;++i){
    if( n%i == 0 ){
      if(i>max) max=i;
    }
  }
    return max;
}

int main()
{
  int n,m;
  cin>>n>>m;
  vector<vector<int>> Vt;
  Vt.resize(n);

  for(auto &it:Vt){
    it.resize(m);
  }

  for(int i = 0;i<n;++i){
    for(int j = 0;j<m;++j){
      int tmp;
      cin>>tmp;
      Vt[i][j] = tmp;
    }
  }

  unordered_map<int,int> Vtmap;
  



  return 0;
}
